package ink.lovejinhu.leetcode;

import ink.lovejinhu.common.TreeNode;

import java.util.List;

/**
 * @author jinhu
 * created 2021-07-09 15:08
 */
public class Solution_0257 {
    /**
     * 二叉树所有的路径
     *
     * @param root
     * @return
     */
    public List<String> binaryTreePaths(TreeNode root) {


        return null;
    }

    public List<String> findway(TreeNode root, List<String> param, String var) {
        if (root == null) {

        }
        return null;
    }
}
